A Cost/ Speed/ Reliability Trade-off in Erasing a Bit
نویسنده
چکیده
We present a novel treatment of the fundamental problem of erasing a bit. We propose a cost function that extends to path space the principle due to Szilard and Landauer that erasing a bit requires at least kBT log 2 units of energy. We introduce notions of reliability of information storage via a reliability timescale τr, and speed of erasing via an erasing timescale τe. Our problem formulation captures the tradeoff between speed, reliability, and the action required to erase a bit. We show that erasing a reliable bit fast costs at least log 2 − 1 2 log ( 1 − e−2τe/τr ) > log 2 units, which goes to 1 2 log 2τr τe units when τr >> τe.
منابع مشابه
Designing the optimal bit: balancing energetic cost, speed and reliability
We consider the challenge of operating a reliable bit that can be rapidly erased. We find that both erasing and reliability times are non-monotonic in the underlying friction, leading to a trade-off between erasing speed and bit reliability. Fast erasure is possible at the expense of low reliability at moderate friction, and high reliability comes at the expense of slow erasure in the underdamp...
متن کاملA Cost/Speed/Reliability Tradeoff to Erasing
We present a Kullback–Leibler (KL) control treatment of the fundamental problem of erasing a bit. We introduce notions of reliability of information storage via a reliability timescale τr, and speed of erasing via an erasing timescale τe. Our problem formulation captures the tradeoff between speed, reliability, and the KL cost required to erase a bit. We show that rapid erasing of a reliable bi...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1410.1710 شماره
صفحات -
تاریخ انتشار 2014